Beyond pairwise network similarity: exploring mediation and suppression between networks
نویسندگان
چکیده
منابع مشابه
Beyond Pairwise Shape Similarity Analysis
This paper considers two major applications of shape matching algorithms: (a) query-by-example, i. e. retrieving the most similar shapes from a database and (b) finding clusters of shapes, each represented by a single prototype. Our approach goes beyond pairwise shape similarity analysis by considering the underlying structure of the shape manifold, which is estimated from the shape similarity ...
متن کاملMediation between Service and Network Composition
In todays Internet the network stack is divided into distinct layers which can be implemented by different protocols. Each layer offers a service to directly adjacent layers. Although this crisp and robust design has proven its advantages (functionality scoping, stability) there are also some disadvantages of this architecture. Protocols on different layers implement the same functionality (e.g...
متن کاملLearning Pairwise Similarity
Overview Different vectorial and / or (dis)similarity representations can be produced for a given data. These distinct representations or data generating models have typically been used individually, in single classifiers or single clustering algorithms, or simultaneously, as in classifier combination techniques or cluster ensemble methods, depending, respectively, on whether working under a su...
متن کاملLearning Similarity Measures from Pairwise Constraints with Neural Networks
This paper presents a novel neural network model, called Similarity Neural Network (SNN), designed to learn similarity measures for pairs of patterns exploiting binary supervision. The model guarantees to compute a non negative and symmetric measure, and shows good generalization capabilities even if a small set of supervised examples is used for training. The approximation capabilities of the ...
متن کاملExtensions to Pairwise Similarity Calculation of Information Networks
We focus on extensions to the pairwise similarity calculation of information networks. By considering both inand out-link relationships, we propose Additiveand Multiplicative-SimRank to calculate the similarity score. Then we discuss the loop/cycles problem of information networks and propose a method to address this problem. Our extensive experimental results conducted on eight food web data s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications Physics
سال: 2021
ISSN: 2399-3650
DOI: 10.1038/s42005-021-00638-9